1976C - Job Interview - CodeForces Solution

def solution():
    n, m = list(map(int, input().split()))
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    total = 0
    lookup = [0]*(n+m+1)
    j = -1
    for i in range(n+m):
        if (a[i] > b[i] and n) or (a[i] < b[i] and not m):
            if (a[i] < b[i] and not m) and j == -1:
                j = i
            lookup[i] = a[i]
            total += a[i]
            n -= 1
        else:
            if (a[i] > b[i] and not n) and j == -1:
                j = i
            lookup[i] = b[i]
            total += b[i]
            m -= 1
    result = [0]*len(lookup)
    result[-1] = total
    for i in range(len(lookup)-1):
        if i < j and (lookup[i] == a[i]) == (lookup[j] != a[j]):
            result[i] = total-lookup[i]+(-lookup[j]+((a[j]+b[j])-lookup[j]))+(a[-1] if lookup[i] != a[i] else b[-1])
        else:
            result[i] = total-lookup[i]+(a[-1] if lookup[i] == a[i] else b[-1])
    return " ".join(map(str, result))

for _ in range(int(input())):
    print(solution())